منابع مشابه
U-statistics in stochastic geometry
A U-statistic of order k with kernel f :X →Rd over a Poisson process is defined in [25] as ∑ x1,...,xk∈η 6= f (x1, . . . ,xk) under appropriate integrability assumptions on f . U-statistics play an important role in stochastic geometry since many interesting functionals can be written as Ustatistics, like intrinsic volumes of intersection processes, characteristics of random geometric graphs, v...
متن کاملThe Clifford Space Geometry of Conformal Gravity and U(4)× U(4) Yang-Mills Unification
It is shown how a Conformal Gravity and U(4)×U(4) Yang-Mills Grand Unification model in four dimensions can be attained from a Clifford Gauge Field Theory in C-spaces (Clifford spaces) based on the (complex) Clifford Cl(4, C) algebra underlying a complexified four dimensional spacetime (8 real dimensions). Upon taking a real slice, and after symmetry breaking, it leads to ordinary Gravity and t...
متن کاملInformation Geometry of U-Boost and Bregman Divergence
We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the space of the finite measures over a label set. We propose two versions of U-B...
متن کاملThe Effect of Inclined U-Notch Geometry on Mode Ratio (KII/KI) under Mixed Mode (I + II) Loading
In inclined U-notches, the mixed mode (I + II) loading occurs and the mode ratio can be increased by varying the notch angle. In this paper, the effect of the inclined U-notch geometry, i.e. the notch depth, the notch angle, the notch root radius, and the position of the notch with respect to supports, on the mode ratio (KII/KI) have been studied. Three-point bending and plane strain condition ...
متن کاملAttaining Capacity with Algebraic Geometry Codes through the (U|U+V) Construction and Koetter-Vardy Soft Decoding
In this paper we show how to attain the capacity of discrete symmetric channels with polynomial time decoding complexity by considering iterated (U | U + V ) constructions with Reed-Solomon code or algebraic geometry code components. These codes are decoded with a recursive computation of the a posteriori probabilities of the code symbols together with the Koetter-Vardy soft decoder used for de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2013
ISSN: 1029-8479
DOI: 10.1007/jhep04(2013)147